On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics

We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discretetime framework, and study the expressive power of several relevant logics. When only subscripted modalities are used, polynomial-time model checking is possible even for the largest logic we consider, while introducing freeze quanti ers leads to a complexity blow-up.